github.com/klauspost/compress/zstd.fastBase.cur (field)
163 uses
github.com/klauspost/compress/zstd (current package)
enc_base.go#L16: cur int32
enc_base.go#L58: if debugAsserts && e.cur > e.bufferReset {
enc_base.go#L59: panic(fmt.Sprintf("ecur (%d) > buffer reset (%d)", e.cur, e.bufferReset))
enc_base.go#L72: e.cur += offset
enc_base.go#L157: if e.cur < e.bufferReset {
enc_base.go#L158: e.cur += e.maxMatchOff + int32(len(e.hist))
enc_best.go#L87: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_best.go#L91: e.cur = e.maxMatchOff
enc_best.go#L95: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_best.go#L103: v = v - e.cur + e.maxMatchOff
enc_best.go#L107: v2 = v2 - e.cur + e.maxMatchOff
enc_best.go#L122: v = v - e.cur + e.maxMatchOff
enc_best.go#L126: v2 = v2 - e.cur + e.maxMatchOff
enc_best.go#L134: e.cur = e.maxMatchOff
enc_best.go#L245: panic(fmt.Sprintf("offset: %d - s:%d - rep: %d - cur :%d - max: %d", offset, s, rep, e.cur, e.maxMatchOff))
enc_best.go#L259: improve(&best, candidateL.offset-e.cur, s, uint32(cv), -1)
enc_best.go#L260: improve(&best, candidateL.prev-e.cur, s, uint32(cv), -1)
enc_best.go#L261: improve(&best, candidateS.offset-e.cur, s, uint32(cv), -1)
enc_best.go#L262: improve(&best, candidateS.prev-e.cur, s, uint32(cv), -1)
enc_best.go#L291: e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: candidateL.offset}
enc_best.go#L292: e.table[nextHashS] = prevEntry{offset: s + e.cur, prev: candidateS.offset}
enc_best.go#L313: improve(&best, candidateS.offset-e.cur, s+1, uint32(cv), -1)
enc_best.go#L315: improve(&best, candidateL.offset-e.cur, s+1, uint32(cv), -1)
enc_best.go#L316: improve(&best, candidateL.prev-e.cur, s+1, uint32(cv), -1)
enc_best.go#L317: improve(&best, candidateL2.offset-e.cur, s+2, uint32(cv2), -1)
enc_best.go#L318: improve(&best, candidateL2.prev-e.cur, s+2, uint32(cv2), -1)
enc_best.go#L322: improve(&best, e.table[hashLen(cv2>>8, bestShortTableBits, bestShortLen)].offset-e.cur, s+3, uint32(cv2>>8), -1)
enc_best.go#L336: if off := candidateEnd.offset - e.cur - best.length + skipBeginning; off >= 0 {
enc_best.go#L338: if off := candidateEnd.prev - e.cur - best.length + skipBeginning; off >= 0 {
enc_best.go#L381: off := index0 + e.cur
enc_best.go#L441: off := index0 + e.cur
enc_best.go#L550: e.cur = e.maxMatchOff
enc_better.go#L65: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_better.go#L69: e.cur = e.maxMatchOff
enc_better.go#L73: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_better.go#L79: v = v - e.cur + e.maxMatchOff
enc_better.go#L90: v = v - e.cur + e.maxMatchOff
enc_better.go#L94: v2 = v2 - e.cur + e.maxMatchOff
enc_better.go#L102: e.cur = e.maxMatchOff
enc_better.go#L173: off := s + e.cur
enc_better.go#L225: off := index0 + e.cur
enc_better.go#L282: off := index0 + e.cur
enc_better.go#L294: coffsetL := candidateL.offset - e.cur
enc_better.go#L295: coffsetLP := candidateL.prev - e.cur
enc_better.go#L349: coffsetS := candidateS.offset - e.cur
enc_better.go#L361: coffsetL = candidateL.offset - e.cur
enc_better.go#L364: e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
enc_better.go#L380: coffsetL = candidateL.prev - e.cur
enc_better.go#L430: coffsetL := candidateL.offset - e.cur - matched + skipBeginning
enc_better.go#L446: coffsetL = candidateL.prev - e.cur - matched + skipBeginning
enc_better.go#L503: off := index0 + e.cur
enc_better.go#L535: e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
enc_better.go#L536: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L588: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_better.go#L596: e.cur = e.maxMatchOff
enc_better.go#L601: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_better.go#L607: v = v - e.cur + e.maxMatchOff
enc_better.go#L618: v = v - e.cur + e.maxMatchOff
enc_better.go#L622: v2 = v2 - e.cur + e.maxMatchOff
enc_better.go#L631: e.cur = e.maxMatchOff
enc_better.go#L691: off := s + e.cur
enc_better.go#L744: off := index0 + e.cur
enc_better.go#L804: off := index0 + e.cur
enc_better.go#L819: coffsetL := candidateL.offset - e.cur
enc_better.go#L820: coffsetLP := candidateL.prev - e.cur
enc_better.go#L874: coffsetS := candidateS.offset - e.cur
enc_better.go#L886: coffsetL = candidateL.offset - e.cur
enc_better.go#L889: e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
enc_better.go#L906: coffsetL = candidateL.prev - e.cur
enc_better.go#L948: coffsetL := candidateL.offset - e.cur - matched
enc_better.go#L963: coffsetL = candidateL.prev - e.cur - matched
enc_better.go#L1019: off := index0 + e.cur
enc_better.go#L1054: e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
enc_better.go#L1056: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L1228: e.cur = e.maxMatchOff
enc_dfast.go#L47: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_dfast.go#L51: e.cur = e.maxMatchOff
enc_dfast.go#L55: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_dfast.go#L61: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L70: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L74: e.cur = e.maxMatchOff
enc_dfast.go#L133: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L180: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L181: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L188: t = candidateL.offset - e.cur
enc_dfast.go#L209: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L212: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L217: t = candidateL.offset - e.cur
enc_dfast.go#L225: t = candidateS.offset - e.cur
enc_dfast.go#L298: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L299: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L333: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L381: if e.cur >= e.bufferReset {
enc_dfast.go#L388: e.cur = e.maxMatchOff
enc_dfast.go#L439: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L487: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L488: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L495: t = candidateL.offset - e.cur
enc_dfast.go#L497: panic(fmt.Sprintf("s (%d) <= t (%d). cur: %d", s, t, e.cur))
enc_dfast.go#L516: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L519: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L524: t = candidateL.offset - e.cur
enc_dfast.go#L532: t = candidateS.offset - e.cur
enc_dfast.go#L602: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L603: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L638: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L672: if e.cur < e.bufferReset {
enc_dfast.go#L673: e.cur += int32(len(src))
enc_dfast.go#L687: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_dfast.go#L696: e.cur = e.maxMatchOff
enc_dfast.go#L700: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_dfast.go#L706: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L715: v = v - e.cur + e.maxMatchOff
enc_dfast.go#L720: e.cur = e.maxMatchOff
enc_dfast.go#L779: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L828: coffsetL := s - (candidateL.offset - e.cur)
enc_dfast.go#L829: coffsetS := s - (candidateS.offset - e.cur)
enc_dfast.go#L836: t = candidateL.offset - e.cur
enc_dfast.go#L857: coffsetL = s - (candidateL.offset - e.cur) + checkAt
enc_dfast.go#L860: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L866: t = candidateL.offset - e.cur
enc_dfast.go#L874: t = candidateS.offset - e.cur
enc_dfast.go#L947: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L948: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L990: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L1074: e.cur = e.maxMatchOff
enc_fast.go#L46: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_fast.go#L51: e.cur = e.maxMatchOff
enc_fast.go#L55: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_fast.go#L61: v = v - e.cur + e.maxMatchOff
enc_fast.go#L65: e.cur = e.maxMatchOff
enc_fast.go#L130: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L131: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L172: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L173: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L176: t = candidate.offset - e.cur
enc_fast.go#L188: t = candidate2.offset - e.cur
enc_fast.go#L258: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L306: if e.cur >= e.bufferReset {
enc_fast.go#L310: e.cur = e.maxMatchOff
enc_fast.go#L367: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L368: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L410: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L411: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L414: t = candidate.offset - e.cur
enc_fast.go#L422: panic(fmt.Sprintf("t (%d) < 0, candidate.offset: %d, e.cur: %d, coffset0: %d, e.maxMatchOff: %d", t, candidate.offset, e.cur, coffset0, e.maxMatchOff))
enc_fast.go#L429: t = candidate2.offset - e.cur
enc_fast.go#L498: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L528: if e.cur < e.bufferReset {
enc_fast.go#L529: e.cur += int32(len(src))
enc_fast.go#L545: for e.cur >= e.bufferReset-int32(len(e.hist)) {
enc_fast.go#L548: e.cur = e.maxMatchOff
enc_fast.go#L552: minOff := e.cur + int32(len(e.hist)) - e.maxMatchOff
enc_fast.go#L558: v = v - e.cur + e.maxMatchOff
enc_fast.go#L562: e.cur = e.maxMatchOff
enc_fast.go#L627: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L629: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L672: coffset0 := s - (candidate.offset - e.cur)
enc_fast.go#L673: coffset1 := s - (candidate2.offset - e.cur) + 1
enc_fast.go#L676: t = candidate.offset - e.cur
enc_fast.go#L688: t = candidate2.offset - e.cur
enc_fast.go#L758: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L836: e.cur = e.maxMatchOff
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |